On Permutor Design for Woven Convolutional Codes with Outer Warp
نویسندگان
چکیده
A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row permutors that significantly exceeds those with known designs. Additionally, simulation results are shown.
منابع مشابه
Woven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملOn the error exponent for woven convolutional codes with inner warp
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.
متن کاملPipeline Decoding of Woven Convolutional Codes
A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...
متن کاملWoven Turbo Codes
A new code construction namely woven turbo codes, is presented , which is a variation of woven convolutional codes. Parallel encoders (turbo codes 2]) can be considered as a special case of woven turbo encoders, where only one outer and inner encoder is used. However, woven turbo codes with a larger number of outer codes yield higher minimum distances than turbo codes with random permutations.
متن کاملWoven convolutional graph codes with large free distances
Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...
متن کامل